Certifying convergence of Lasserre's hierarchy via flat truncation
نویسنده
چکیده
Consider the optimization problem of minimizing a polynomial function subject to polynomial constraints. A typical approach for solving it globally is applying Lasserre’s hierarchy of semidefinite relaxations, based on either Putinar’s or Schmüdgen’s Positivstellensatz. A practical question in applications is: how to certify its convergence and get minimizers? In this paper, we propose flat truncation as a certificate for this purpose. Assume the set of global minimizers is nonempty and finite. Our main results are: i) Putinar type Lasserre’s hierarchy has finite convergence if and only if flat truncation holds, under some generic assumptions; the same conclusion holds for the Schmüdgen type one under weaker assumptions. ii) Flat truncation is asymptotically satisfied for Putinar type Lasserre’s hierarchy if the archimedean condition holds; the same conclusion holds for the Schmüdgen type one if the feasible set is compact. iii) We show that flat truncation can be used as a certificate to check exactness of standard SOS relaxations and Jacobian SDP relaxations.
منابع مشابه
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864−885], obtained by searching for an optimal probability density function h on K which is a sum of squares of polynomials, so that the expectation ∫ K f(x)h(x)dx is minimized. We show that the rate of convergence i...
متن کاملConvergence, Consistency and Stability in Fuzzy Differential Equations
In this paper, we consider First-order fuzzy differential equations with initial value conditions. The convergence, consistency and stability of difference method for approximating the solution of fuzzy differential equations involving generalized H-differentiability, are studied. Then the local truncation error is defined and sufficient conditions for convergence, consistency and stability of ...
متن کاملCertifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy
Given a random n-variate degree-d homogeneous polynomial f , we study the following problem:
متن کاملCOSC460 Honours Report: A Sequential Steady-State Detection Method for Quantitative Discrete-Event Simulation
In quantitative discrete-event simulation, the initial transient phase causes bias in the estimation of steady-state performance measures. Methods for detecting and truncating this phase make calculating accurate estimates from the truncated sample possible, but no methods proposed in the literature have proved to work successfully in the sequential analysis of simulated systems. This report pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 142 شماره
صفحات -
تاریخ انتشار 2013